Second-Order Optimality Conditions in Generalized Semi-Infinite Programming
نویسندگان
چکیده
This paper deals with generalized semi-infinite optimization problems where the (infinite) index set of inequality constraints depends on the state variables and all involved functions are twice continuously differentiable. Necessary and sufficient second order optimality conditions for such problems are derived under assumptions which imply that the corresponding optimal value function is second order (parabolically) directionally differentiable and second order epiregular at the considered point. These sufficient conditions are, in particular, equivalent to the second order growth condition. AMS-Subject Classification: 90 C 30, 90 C34, 49M 39
منابع مشابه
Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملFirst order optimality conditions for generalized semi-infinite programming problems
In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...
متن کاملOptimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions
In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...
متن کاملSemi-infinite programming, duality, discretization and optimality conditions
The aim of this paper is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization, and first and second order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research.
متن کاملNecessary Optimality and Duality for Multiobjective Semi-infinite Programming
The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...
متن کامل